Contingent versus Deterministic Plans in Multi-Modal Journey Planning

نویسندگان

  • Adi Botea
  • Stefano Braghin
چکیده

Deterministic planning is the de facto standard in deployed multi-modal journey planning systems. However, in reality, transportation networks feature many types of uncertainty, including variations of the arrival and the departure times of public transport vehicles. Under uncertainty, deterministic plans could result in missed connections, leading to an arrival time much worse than originally planned. We contribute an empirical study using transportation network data from three European cities. We show that, in the presence of uncertainty, contingent plans can often provide significant savings in terms of travel time. We view our results as important because they advocate adopting uncertainty-aware multi-modal journey plans, shifting from the current practice based on using deterministic planning.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Modal Journey Planning in the Presence of Uncertainty

Multi-modal journey planning, which allows multiple types of transport within a single trip, is becoming increasingly popular, due to a strong practical interest and an increasing availability of data. In real life, transport networks feature uncertainty. Yet, most approaches assume a deterministic environment, making plans more prone to failures such as major delays in the arrival. We model th...

متن کامل

Bounded Branching and Modalities in Non-Deterministic Planning

We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when modal formulae are introduced into the description language. New planning tasks, such as whether there exists a plan with at most k branch points for a fully (or partially) observable non-deterministic domain, and whet...

متن کامل

Computing Contingent Plans via Fully Observable Non-Deterministic Planning

Planning with sensing actions under partial observability is a computationally challenging problem that is fundamental to the realization of AI tasks in areas as diverse as robotics, game playing, and diagnostic problem solving. Recent work on generating plans for partially observable domains has advocated for online planning, claiming that offline plans are often too large to generate. Here we...

متن کامل

A Decision Support System for Urban Journey Planning in Multimodal Public Transit Network

The goal of this paper is to develop a Decision Support System (DSS) as a journey planner in complex and large multimodal urban network called Rahyar. Rahyar attempts to identify the most desirable itinerary among all feasible alternatives. The desirability of an itinerary is measured by a disutility function, which is defined as a weighted sum of some criteria. The weight...

متن کامل

A Multi-Path Compilation Approach to Contingent Planning

We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a linear, classical plan. This allows our planner, MPSR, to reason about multiple future outcomes of sensing actions, and makes it less susceptible to dead-ends. MPRS, however, generates very large classical planning pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015